Creating Semi-Magic, Magic and Extra Magic n× n Squares when n is Odd
نویسندگان
چکیده
We define a simple algorithm for creating large numbers of semi-magic n× n squares when n is odd. Special cases of the algorithm can also be used to easily create magic and extra magic (or panmagic) n× n squares when n is odd. The algorithm can also create extremely magic n × n squares when n ≥ 5 is prime. These extremely magic n × n squares have n! standard magic n-element subsets, and these n! standard magic n-element subsets include the n rows and n columns as well as the 2n generalized diagonals.
منابع مشابه
Totally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملNumerical Enumeration of Greco-Latin Prime Order Associative Magic Squares
A magic square of order n consists of the numbers 1 to n placed such that the sum of each row, column and principal diagonal equals the magic sum n(n +1)/2. In addition, an odd ordered magic square is associative or self-complementary if diagonally opposite elements have the same sum (n +1)/2. The magic square is said to be regular Greco-Latin if it can be decomposed as a sum of a pair of Latin...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
متن کاملSemi-magic Squares and Elliptic Curves
We show that, for all odd natural numbers N , the N-torsion points on an elliptic curve may be placed in an N × N grid such that the sum of each column and each row is the point at infinity.
متن کامل